Numerical Model for 32-bit Magnonic Ripple Carry Adder

نویسندگان

چکیده

In CMOS-based electronics, the most straightforward way to implement a summation operation is use ripple carry adder (RCA). Magnonics, field of science concerned with data processing by spin-waves and their quanta magnons, recently proposed magnonic half-adder that can be considered as simplest integrated circuit. Here, we develop computation model for basic blocks enable design simulation gates circuits arbitrary complexity demonstrate its functionality on example 32-bit RCA. It shown RCA requires utilization additional regenerators based directional couplers embedded amplifiers normalize magnon signals in-between half-adders. The benchmarking large-scale performed. energy consumption 30 nm-based low 961aJ per taking into account all required amplifiers.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Analysis of Low Power High Performance 32-bit Ripple Carry Adder with Proposed Adder Cell

In this work one bit Full Adder with Ten transistors have been proposed. Reducing Power dissipation, supply voltage, leakage currents, area of chip are the most important parameters in today`s VLSI designs. The system reliability can be increased by reducing the cost, weight and physical size and it is achieved by decreasing the transistor count. Therefore the minimum power consumption target a...

متن کامل

Variable delay ripple carry adder with carry chain interrupt detection

Various implementations are known for the efficient implementation of adders. As opposed to traditional optimization techniques a statistical approach using early termination detection is used in this article to obtain efficient implementations for large operands. The completion detection logic is described and the efficiency of the approach is shown and analyzed analytically and through comput...

متن کامل

Performance Analysis of 32-Bit Array Multiplier with a Carry Save Adder and with a Carry-Look-Ahead Adder

In this paper, design of two different array multipliers are presented, one by using carry-look-ahead (CLA) logic for addition of partial product terms and another by introducing Carry Save Adder (CSA) in partial product lines. The multipliers presented in this paper were all modeled using VHDL (Very High Speed Integration Hardware Description Language) for 32-bit unsigned data. The comparison ...

متن کامل

An Area Efficient 32-bit Carry-select Adder for Low Power Applications

CSLA is used in many computational systems to alleviate the problem of carry propagation delay by independently generating multiple carries and then select a carry to generate the sum [1]. However, the CSLA is not area efficient because it uses multiple pairs of Ripple Carry Adders (RCA) to generate partial sum and carry by considering carry input Cin=0 and cin=1, then the final sum and carry a...

متن کامل

An Efficient Low Power Ripple Carry Adder for Ultra Applications

The main goal of this paper is to provide new low power solutions for very large scale integration. Designers especially focus on the reduction of the power dissipation which shows increasing growth with the scaling down of the technologies. In this paper various technologies at the different levels of the design process have been implemented to reduce the power dissipation at the circuit, arch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Emerging Topics in Computing

سال: 2023

ISSN: ['2168-6750', '2376-4562']

DOI: https://doi.org/10.1109/tetc.2023.3238581